Functional hypergraph uncovers novel covariant structures over neurodevelopment.

نویسندگان

  • Shi Gu
  • Muzhi Yang
  • John D Medaglia
  • Ruben C Gur
  • Raquel E Gur
  • Theodore D Satterthwaite
  • Danielle S Bassett
چکیده

Brain development during adolescence is marked by substantial changes in brain structure and function, leading to a stable network topology in adulthood. However, most prior work has examined the data through the lens of brain areas connected to one another in large-scale functional networks. Here, we apply a recently developed hypergraph approach that treats network connections (edges) rather than brain regions as the unit of interest, allowing us to describe functional network topology from a fundamentally different perspective. Capitalizing on a sample of 780 youth imaged as part of the Philadelphia Neurodevelopmental Cohort, this hypergraph representation of resting-state functional MRI data reveals three distinct classes of subnetworks (hyperedges): clusters, bridges, and stars, which respectively represent homogeneously connected, bipartite, and focal architectures. Cluster hyperedges show a strong resemblance to previously-described functional modules of the brain including somatomotor, visual, default mode, and salience systems. In contrast, star hyperedges represent highly localized subnetworks centered on a small set of regions, and are distributed across the entire cortex. Finally, bridge hyperedges link clusters and stars in a core-periphery organization. Notably, developmental changes within hyperedges are ordered in a similar core-periphery fashion, with the greatest developmental effects occurring in networked hyperedges within the functional core. Taken together, these results reveal a novel decomposition of the network organization of human brain, and further provide a new perspective on the role of local structures that emerge across neurodevelopment. Hum Brain Mapp 38:3823-3835, 2017. © 2017 Wiley Periodicals, Inc.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requi...

متن کامل

no-homomorphism conditions for hypergraphs

In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.

متن کامل

Hypergraph Decomposition and Secret Sharing

In this paper we investigate the construction of efficient secret sharing schemes by using a technique called hypergraph decomposition, extending in a non-trivial way the previously studied graph decomposition technique. A major advantage advantage of hypergraph decomposition is that it applies to any access structure, rather than only structures representable as graphs. As a consequence we obt...

متن کامل

Hypergraph Based Visual Segmentation and Retrieval

This chapter explores original techniques for the construction of hypergraph models for computer vision applications. A hypergraph is a generalization of a pairwise simple graph, where an edge can connect any number of vertices. The expressive power of the hypergraph models places a special emphasis on the relationship among three or more objects, which has made hypergraphs better models of cho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Human brain mapping

دوره 38 8  شماره 

صفحات  -

تاریخ انتشار 2017